Quantum commitments from complexity assumptions
نویسندگان
چکیده
منابع مشابه
Statistical Assumptions as Empirical Commitments
Researchers who study punishment and social control, like those who study other social phenomena, typically seek to generalize their findings from the data they have to some larger context: in statistical jargon, they generalize from a sample to a population. Generalizations are one important product of empirical inquiry. Of course, the process by which the data are selected introduces uncertai...
متن کاملUnconditionally Secure and Universally Composable Commitments from Physical Assumptions
We present a constant-round unconditional black-box compiler, that transforms any ideal straightline extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security [Can01]. We exemplify the usefulness of our compiler providing two (constantround) instantiations of ideal straight-line extractable commitment using (malicious) PUFs [OSVW13] an...
متن کاملChanging Commitments Based on Reasons and Assumptions
Intention reconsideration is a central challenge in BDI theory. The intention reconsideration models of the early nineties focus on when a commitment may be reconsidered, for example when it has been achieved, when it is no longer achievable, or when the associated goal has been dropped. In this paper, we create an abstract framework in which we add the “reasons” and the “assumptions” that form...
متن کاملMercurial Commitments: Minimal Assumptions and Efficient Constructions
(Non-interactive) Trapdoor Mercurial Commitments (TMCs) were introduced by Chase et al. [8] and form a key building block for constructing zero-knowledge sets (introduced by Micali, Rabin and Kilian [28]). TMCs are quite similar and certainly imply ordinary (noninteractive) trapdoor commitments (TCs). Unlike TCs, however, they allow for some additional freedom in the way the message is opened: ...
متن کاملMinimal Assumptions for Efficient Mercurial Commitments
Mercurial commitments were introduced by Chase et al. [8] and form a key building block for constructing zero-knowledge sets (introduced by Micali, Rabin and Kilian [27]). Unlike regular commitments, which are strictly binding, mercurial commitments allow for certain amount of (limited) freedom. The notion of [8] also required that mercurial commitments should be equivocable given a certain tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2015
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-015-0116-5